The Generalization Error Bound for the Multiclass Analytical Center Classifier
نویسندگان
چکیده
This paper presents the multiclass classifier based on analytical center of feasible space (MACM). This multiclass classifier is formulated as quadratic constrained linear optimization and does not need repeatedly constructing classifiers to separate a single class from all the others. Its generalization error upper bound is proved theoretically. The experiments on benchmark datasets validate the generalization performance of MACM.
منابع مشابه
A Comparison of SVM-based Evolutionary Methods for Multicategory Cancer Diagnosis using Microarray Gene Expression Data
Selection of relevant genes that will give higher accuracy for sample classification (for example, to distinguish cancerous from normal tissues) is a common task in most microarray data studies. An evolutionary method based on generalization error bound theory of support vector machine (SVM) can select a subset of potentially informative genes for SVM classifier very efficiently. The bound theo...
متن کاملBetter multiclass classification via a margin-optimized single binary problem
We develop a new multiclass classification method that reduces the multiclass problem to a single binary classifier (SBC). Our method constructs the binary problem by embedding smaller binary problems into a single space. A good embedding will allow for large margin classification. We show that the construction of such an embedding can be reduced to the task of learning linear combinations of k...
متن کاملRademacher Complexity Bounds for a Penalized Multiclass Semi-Supervised Algorithm
We propose Rademacher complexity bounds for multiclass classifiers trained with a two-step semi-supervised model. In the first step, the algorithm partitions the partially labeled data and then identifies dense clusters containing κ predominant classes using the labeled training examples such that the proportion of their non-predominant classes is below a fixed threshold. In the second step, a ...
متن کاملOn Flat versus Hierarchical Classification in Large-Scale Taxonomies
We study in this paper flat and hierarchical classification strategies in the context of large-scale taxonomies. To this end, we first propose a multiclass, hierarchical data dependent bound on the generalization error of classifiers deployed in large-scale taxonomies. This bound provides an explanation to several empirical results reported in the literature, related to the performance of flat ...
متن کاملSuperior Multi-Class Classification Through a Margin-Optimized Single Binary Problem
The problem of multiclass-to-binary reductions in the context of classification with kernel machines continues to attract considerable attention. Indeed, the current understanding of this problem is rather limited. Despite the multitude of proposed solutions no single method is known to be consistently superior to others. We developed a new multi-class classification method that reduces the mul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013